%0 Conference Proceedings
%4 dpi.inpe.br/ambro/1998/06.02.16.57
%2 sid.inpe.br/banon/2001/03.30.15.56.59
%T Novos resultados em triangulações
%D 1997
%A Gonçalves, Luiz Marcos Garcia,
%E Figueiredo, Luiz Henrique de,
%E Netto, Marcio Lobo,
%B Brazilian Symposium on Computer Graphics and Image Processing, 10 (SIBGRAPI)
%C Campos de Jordão, SP, Brazil
%8 Oct. 1997
%I Sociedade Brasileira de Computação
%J Porto Alegre
%S Proceedings
%1 SBC - Sociedade Brasileira de Computação; USP - Universidade de São Paulo
%K greedy triangulation, delaunay triangulation, adaptive rectangular triangulation, triangulation data structure.
%X This paper describes a data structure with a restricted set of topological operations (creation, subdivision, and flip) used to construct planar triangulations. We discuss the implementation of algorithms to build some common triangulations (greedy, Delaunay, and rectangular adaptive) based on that structure. In order to allow the use of such a structure in the implementation of the Greedy Triangulation (GT), we define a new concept of GT and present an algorithm to build it. This GT algorithm has the same complexity as the best known algorithm for the traditional GT.
%3 art58.pdf
%O The conference was held in Campos de Jordão, SP, Brazil, from October 13 to 16.